Some Remarks on Dodgson's Voting Rule
نویسنده
چکیده
Sparked by a remarkable result due to Hemaspaandra et al. [1], the voting rule attributed to Charles Dodgson (aka Lewis Carroll) has become one of the most studied voting rules in computational social choice. However, the computer science literature often neglects that Dodgson’s rule has some serious shortcomings as a choice procedure. This short note contains four examples revealing Dodgson’s deficiencies.
منابع مشابه
An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack
Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...
متن کاملStrategic approval voting in a large electorate
The paper considers approval voting for a large population of voters. It is proven that, based on statistical information about candidate scores, rational voters vote sincerly and according to a simple behavioral rule. It is also proven that if a Condorcet-winner exists, this candidate is elected. ∗Thanks to Steve Brams, Nicolas Gravel, François Maniquet, Remzi Sanver and Karine Van der Straete...
متن کاملFraction-Free Computation of Determinants
Here we examine Dodgson's Method, a fraction-free methods for computing determinants. In some cases, this method fails due to division by zero. We propose a workaround for Dodgson's Method that ensures it also can be used to compute the determinant of any integer matrix.
متن کاملSOME REMARKS ON ALMOST UNISERIAL RINGS AND MODULES
In this paper we study almost uniserial rings and modules. An R−module M is called almost uniserial if any two nonisomorphic submodules are linearly ordered by inclusion. A ring R is an almost left uniserial ring if R_R is almost uniserial. We give some necessary and sufficient condition for an Artinian ring to be almost left uniserial.
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 55 شماره
صفحات -
تاریخ انتشار 2009